Qu'est-ce (qui) est multigraph$552142$ - définition
GRAPH WHICH IS PERMITTED TO HAVE MULTIPLE EDGES
Pseudograph; Labeled multigraph; Multidigraph; Labeled multidigraph; Underlying digraph; Mixed multigraph; Directed multigraph; Multigraph (mathematics)
Multigraph
In mathematics, and more specifically in graph theory, a multigraph is a graph which is permitted to have multiple edges (also called parallel edgesFor example, see Balakrishnan 1997, p. 1 or Chartrand and Zhang 2012, p.
Pseudograph
·noun A false writing; a spurious document; a forgery.
Multigraph
·add. ·noun A combined rotary type-setting and printing machine for office use. The type is transferred semi-automatically by means of keys from a type-supply drum to a printing drum. The printing may be done by means of an inked ribbon to print "typewritten" letters, or directly from inked type or a stereotype plate, as in a printing press.
Wikipédia
Multigraph
In mathematics, and more specifically in graph theory, a multigraph is a graph which is permitted to have multiple edges (also called parallel edges), that is, edges that have the same end nodes. Thus two vertices may be connected by more than one edge.
There are 2 distinct notions of multiple edges:
- Edges without own identity: The identity of an edge is defined solely by the two nodes it connects. In this case, the term "multiple edges" means that the same edge can occur several times between these two nodes.
- Edges with own identity: Edges are primitive entities just like nodes. When multiple edges connect two nodes, these are different edges.
A multigraph is different from a hypergraph, which is a graph in which an edge can connect any number of nodes, not just two.
For some authors, the terms pseudograph and multigraph are synonymous. For others, a pseudograph is a multigraph that is permitted to have loops.
